Carlitz-Wan conjecture for permutation polynomials and Weil bound for curves over finite fields
نویسندگان
چکیده
The Carlitz-Wan conjecture, which is now a theorem, asserts that for any positive integer n, there is a constant Cn such that if q is any prime power > Cn with GCD(n, q−1) > 1, then there is no permutation polynomial of degree n over the finite field with q elements. From the work of von zur Gathen, it is known that one can take Cn = n4. On the other hand, a conjecture of Mullen, which asserts essentially that one can take Cn = n(n−2) has been shown to be false. In this paper, we use a precise version of Weil bound for the number of points of affine algebraic curves over finite fields to obtain a refinement of the result of von zur Gathen where n4 is replaced by a sharper bound. As a corollary, we show that Mullen’s conjecture holds in the affirmative if n(n− 2) is replaced by n2(n− 2)2.
منابع مشابه
Permutation Polynomials and Resolution of Singularities over Finite Fields
A geometric approach is introduced to study permutation polynomials over a finite field. As an application, we prove that there are no permutation polynomials of degree 2/ over a large finite field, where / is an odd prime. This proves that the Carlitz conjecture is true for n = 21. Previously, the conjecture was known to be true only for n < 16.
متن کاملWorkshop on Polynomials over Finite Fields: Functional and Algebraic Properties
1. Omran Ahmadi (Institute for Research in Fundamental Sciences (IPM), Iran) Sets with many pairs of orthogonal vectors over finite fields Abstract: Let n be a positive integer and B be a non-degenerate symmetric bilinear form on Fq, where q is an odd prime power and Fq is the finite field with q elements. We determine the largest possible cardinality of a subset S ⊂ Fq such that |{B(x, y) |x, ...
متن کاملA Weil–bound free proof of Schur’s conjecture
Let f be a polynomial with coefficients in the ring OK of integers of a number field. Suppose that f induces a permutation on the residue fields OK/p for infinitely many non-zero prime ideals p of OK . Then Schur’s conjecture, namely that f is a composition of linear and Dickson polynomials, has been proved by M. Fried. All the present versions of the proof use Weil’s bound on the number of poi...
متن کاملOn the difference between permutation polynomials over finite fields
The well-known Chowla and Zassenhaus conjecture, proven by Cohen in 1990, states that if p > (d2 − 3d+ 4)2, then there is no complete mapping polynomial f in Fp[x] of degree d ≥ 2. For arbitrary finite fields Fq, a similar non-existence result is obtained recently by Işık, Topuzoğlu and Winterhof in terms of the Carlitz rank of f .
متن کاملOn permutation polynomials over finite fields: differences and iterations
The Carlitz rank of a permutation polynomial f over a finite field Fq is a simple concept that was introduced in the last decade. Classifying permutations over Fq
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Finite Fields and Their Applications
دوره 28 شماره
صفحات -
تاریخ انتشار 2014